Making CAT S out of kittens description logics with aggregates

Based on the research done in the last decade attempts have been made to propose descrip tion logics as unifying formalisms for the var ious class based representation languages used in di erent areas These attempts have made apparent that sound complete and decidable description logics still su er from several lim itations regarding modeling classes of aggre gate objects expressing general inclusion ax ioms and the ability of navigating links be tween classes In this paper we propose a pow erful description logic overcoming the above limitations and we show that its reasoning tasks are decidable in worst case exponential time